User–Base-Station Association in HetSNets: Complexity and Efficient Algorithms
نویسندگان
چکیده
منابع مشابه
User-Base-Station Association in HetSNets: Complexity and Efficient Algorithms
This work considers the problem of user association to small-cell base stations (SBSs) in a heterogeneous and small-cell network (HetSNet). Two optimization problems are investigated, which are maximizing the set of associated users to the SBSs (the unweighted problem) and maximizing the set of weighted associated users to the SBSs (the weighted problem), under signal-to-interference-plusnoise ...
متن کاملOn the Base Station Association Problem in HetSNets
The dense deployment of small-cell base stations in HetSNets requires efficient resource allocation techniques. More precisely, the problem of associating users to SBSs must be revised and carefully studied. This problem is NP-hard and requires solving an integer optimization problem. In order to efficiently solve this problem, we model it using non-cooperative game theory. First, we design two...
متن کاملMetaqueries: Semantics, complexity, and efficient algorithms
Metaquery (metapattern) is a data mining tool which is useful for learning rules involving more than one relation in the database. The notion of a metaquery has been proposed as a template or a second-order proposition in a language L that describes the type of pattern to be discovered. This tool has already been successfully applied to several real-world applications. In this paper we advance ...
متن کاملCollaborative Clustering: Sample Complexity and Efficient Algorithms
We study the problem of collaborative clustering. This problem is concerned with a set of items grouped into clusters that we wish to recover from ratings provided by users. The latter are also clustered, and each user rates a random but typical small number of items. The observed ratings are random variables whose distributions depend on the item and user clusters only. Unlike for collaborativ...
متن کاملEfficient algorithms in quantum query complexity
In this thesis we provide new upper and lower bounds on the quantum query complexity of a diverse set of problems. Specifically, we study quantum algorithms for Hamiltonian simulation, matrix multiplication, oracle identification, and graph-property recognition. For the Hamiltonian simulation problem, we provide a quantum algorithm with query complexity sublogarithmic in the inverse error, an e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2017
ISSN: 0018-9545,1939-9359
DOI: 10.1109/tvt.2016.2558501